WB JECA MCA 2025 Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

WB JECA MCA
Previous Year Questions

WB JECA MCA
Previous Year Questions
WB JECA MCA

WB JECA MCA Previous Year Questions (PYQs)

WB JECA MCA 2025 PYQ

Qus : 1 WB JECA MCA PYQ 2025

Which of the following types of memory is non-volatile?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

EPROM is non-volatile memory; it retains data even after power is off.

Qus : 2 WB JECA MCA PYQ 2025

Which of the following statements about RAM is correct?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

RAM is volatile memory used for temporary storage during program execution.

Qus : 3 WB JECA MCA PYQ 2025

Which of the following best distinguishes a sequential circuit from a combinational circuit?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Sequential circuits depend on both current inputs and past states (memory), unlike combinational circuits.

Qus : 4 WB JECA MCA PYQ 2025

A system has a 16-bit data bus and a 20-bit address bus. What is the maximum amount of data (in bytes) the system can directly address in memory?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Address bus = 20 bits → $2^{20}$ addresses → 1 MB memory.

Qus : 5 WB JECA MCA PYQ 2025

1 nibble = ______ bits

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

1 nibble = 4 bits.

Qus : 6 WB JECA MCA PYQ 2025

Which of the following is not a type of computer code?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

EDIC is not a valid code; others are standard encoding schemes.

Qus : 7 WB JECA MCA PYQ 2025

What will be output of the following code snippet?

#include int main()

{

float x = 5;

if(x > 10)

printf("Greater");

else if(x = 10)

printf("Equal");

else

printf("Smaller");

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Assignment x=10 makes condition true → prints "Equal".

Qus : 8 WB JECA MCA PYQ 2025

What will be output of the following code snippet?

#include int main()

{

int i;

for (i=1;i<=5;i++)

{

if(i == i)

continue;

printf("%d ", i);

}

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Condition i==i always true → continue always → nothing printed.

Qus : 9 WB JECA MCA PYQ 2025

Which of the following statements about arrays in C is correct?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Array name gives base address; indexing starts from 0.

Qus : 10 WB JECA MCA PYQ 2025

Read the following statements about functions in C and choose the correct option:

(i) A function in C can return only one value directly.

(ii) Function names can be the same as variable names in the same scope.

(iii) A function must always take at least one argument.

(iv) Recursion is allowed in C functions.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

(i) true, (ii) false, (iii) false, (iv) true.

Qus : 11 WB JECA MCA PYQ 2025

What happens when a recursive function in C lacks a proper base condition?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

No base condition → infinite recursion → stack overflow.

Qus : 12 WB JECA MCA PYQ 2025

What will be the output of the following C code?

#include int main()

{

int a = 10;

int *p = &a;

printf("%d ", *p);

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

*p gives value stored at address of a → 10.

Qus : 13 WB JECA MCA PYQ 2025

A risk in a software project has a probability of occurrence of 0.3 and the potential loss if it occurs is estimated to be Rs 2,00,000. What is the Risk Exposure (RE) for this risk?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

RE = Probability × Loss = 0.3 × 200000 = 60000.

Qus : 14 WB JECA MCA PYQ 2025

Which metric gives the best measure of efficiency in a defect discovery process across software development phases?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

DRE measures effectiveness of defect detection across phases.

Qus : 15 WB JECA MCA PYQ 2025

Which testing approach specifically ensures that all logical conditions in a decision are tested at least once?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Condition coverage ensures each condition is tested true and false.

Qus : 16 WB JECA MCA PYQ 2025

Which of the following pairs correctly matches the type of testing with its main focus or environment?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Alpha testing is performed at developer site before release.

Qus : 17 WB JECA MCA PYQ 2025

Which of the following statements about structures and unions in C is true?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Union size = size of largest member; structure uses separate memory with padding.

Qus : 18 WB JECA MCA PYQ 2025

What will be the output of the following program?

#include int main()

{

char str1[20] = "Hello ";

char str2[20] = "Hello";

strcpy(str2, str1);

if (strcmp(str1, str2) == 0)

printf("Equal ");

else

printf("Not Equal ");

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

After strcpy, both strings are same → strcmp returns 0 → Equal.

Qus : 19 WB JECA MCA PYQ 2025

In the context of software quality management, which of the following focuses on preventing defects rather than detecting them?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

QA focuses on prevention, QC/testing focus on detection.

Qus : 20 WB JECA MCA PYQ 2025

What is the range of unsigned int in C?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Unsigned int (16-bit) ranges from 0 to 2^16 - 1 = 65535.

Qus : 21 WB JECA MCA PYQ 2025

Which of the following options with grep is used to ignore case while searching?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

-i option is used for case-insensitive search.

Qus : 22 WB JECA MCA PYQ 2025

Which of the following is not a typical use of stacks?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

BFS uses queue, not stack.

Qus : 23 WB JECA MCA PYQ 2025

In a circular queue of size n, when is the queue considered full?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Queue full when next position of rear is front.

Qus : 24 WB JECA MCA PYQ 2025

Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Inorder traversal of BST gives sorted order.

Qus : 25 WB JECA MCA PYQ 2025

The running time T(n) of an algorithm is given as follows: T(n)=c+T(n-1), if n>1 and =d if n≤1. Here c and d are constants.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Linear recurrence → T(n)=O(n).

Qus : 26 WB JECA MCA PYQ 2025

The order of an algorithm that finds whether a given Boolean function of n variables produces 1 is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Worst case checks all combinations → O(2^n).

Qus : 27 WB JECA MCA PYQ 2025

Which of the following can be done with Linked List?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

All listed implementations are possible.

Qus : 28 WB JECA MCA PYQ 2025

What is the worst case time complexity to access an element in a binary search tree?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Unbalanced BST → O(n).

Qus : 29 WB JECA MCA PYQ 2025

Packet switching means:

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Data is divided into packets and transmitted independently.

Qus : 30 WB JECA MCA PYQ 2025

Which of the following represents postorder traversal of a binary tree?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Postorder = Left, Right, Root.

Qus : 31 WB JECA MCA PYQ 2025

In a graph of n nodes and n edges, how many cycles will be present?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Graph with n edges has at most one cycle.

Qus : 32 WB JECA MCA PYQ 2025

What is the value of the postfix expression 6 3 2 4 + - *?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

6*(3-(2+4))=6*(-3)=-18.

Qus : 33 WB JECA MCA PYQ 2025

Which of the following points is/are not true about Linked List data structure when it is compared with an array?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Access in linked list is slower than arrays.

Qus : 34 WB JECA MCA PYQ 2025

What is a dequeue?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Deque allows insertion/deletion at both ends.

Qus : 35 WB JECA MCA PYQ 2025

What is the best case time complexity of deleting a node in a Singly Linked List?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Best case deletion is constant time.

Qus : 36 WB JECA MCA PYQ 2025

Which of the following is the correct sequence of stages in a basic instruction pipeline?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Standard pipeline: Fetch, Decode, Execute.

Qus : 37 WB JECA MCA PYQ 2025

________ contains firmware that boots the system.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

ROM stores firmware (BIOS).

Qus : 38 WB JECA MCA PYQ 2025

Which of the following is not a valid characteristic of SRAM?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

SRAM does not require refreshing.

Qus : 39 WB JECA MCA PYQ 2025

The sequence of events that happen during a typical fetch operation is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Correct fetch sequence includes MDR before IR.

Qus : 40 WB JECA MCA PYQ 2025

How many 2-input multiplexers are required to construct a 2^10-multiplexer?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

2^n MUX needs (2^n - 1) 2-input MUX → 1023.

Qus : 41 WB JECA MCA PYQ 2025

Which one is not a part of Process Control Block (PCB)?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

PCB stores process state, PC, registers but not source code.

Qus : 42 WB JECA MCA PYQ 2025

In the process lifecycle, the queue where processes wait for CPU allocation is called the ______ queue.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Ready queue holds processes waiting for CPU.

Qus : 43 WB JECA MCA PYQ 2025

In an operating system, a thread is best described as

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Thread is the smallest schedulable unit.

Qus : 44 WB JECA MCA PYQ 2025

Which of the following scheduling algorithms can work in both preemptive and non-preemptive modes?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Priority scheduling can be both preemptive and non-preemptive.

Qus : 45 WB JECA MCA PYQ 2025

Which of the following is a deadlock avoidance algorithm?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Banker’s algorithm is used for deadlock avoidance.

Qus : 46 WB JECA MCA PYQ 2025

Which type of fragmentation occurs inside allocated memory blocks?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Internal fragmentation occurs within allocated blocks.

Qus : 47 WB JECA MCA PYQ 2025

Which of the following statements is true about paging and fragmentation?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Paging removes external fragmentation but may have internal fragmentation.

Qus : 48 WB JECA MCA PYQ 2025

Which command is used to find the number of lines, words and characters in a file in Unix?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

wc command counts lines, words and characters.

Qus : 49 WB JECA MCA PYQ 2025

Which Unix command will change the group ownership of the file report.txt to the group staff?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

chgrp changes group ownership.

Qus : 50 WB JECA MCA PYQ 2025

In Unix, user wants to change the priority of a running process, which is the suitable command?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

renice changes priority of running process.

Qus : 51 WB JECA MCA PYQ 2025

In the OSI model, which layer is responsible for detecting errors caused during physical transmission?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Data link layer handles error detection.

Qus : 52 WB JECA MCA PYQ 2025

In the TCP/IP model, ______ is responsible for determining the best path for data packets to travel across interconnected networks.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Internet layer handles routing.

Qus : 53 WB JECA MCA PYQ 2025

Which type of routing automatically changes its path selection based on current network conditions like congestion or link failures?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Adaptive routing adjusts based on network conditions.

Qus : 54 WB JECA MCA PYQ 2025

Which of the following protocols is connectionless and provides unreliable data delivery?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

IP and UDP are connectionless and unreliable.

Qus : 55 WB JECA MCA PYQ 2025

Which field in the IPv4 header helps uniquely identify fragments of a datagram so they can be reassembled correctly?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Identification field helps in fragment reassembly.

Qus : 56 WB JECA MCA PYQ 2025

The IP address 10.5.6.7 belongs to which class?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Class A range: 1–126.

Qus : 57 WB JECA MCA PYQ 2025

Which application layer protocol is primarily used for sending email?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

SMTP is used for sending emails.

Qus : 58 WB JECA MCA PYQ 2025

What does a firewall primarily do?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Firewall filters incoming/outgoing traffic.

Qus : 59 WB JECA MCA PYQ 2025

Which attack involves intercepting and altering communication between two parties without their knowledge?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

MITM attack intercepts communication.

Qus : 60 WB JECA MCA PYQ 2025

Which device is used to connect multiple devices within the same network segment and operates at the data link layer?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Switch works at data link layer.

Qus : 61 WB JECA MCA PYQ 2025

A data dictionary is a special file that contains

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Data dictionary stores metadata like names, types, sizes.

Qus : 62 WB JECA MCA PYQ 2025

A functional dependency of the form X → Y is trivial if

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Trivial FD when RHS is subset of LHS.

Qus : 63 WB JECA MCA PYQ 2025

There is a possibility of a cascading rollback when

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Dirty read/write leads to cascading rollback.

Qus : 64 WB JECA MCA PYQ 2025

In an entity relationship, y is the dominant entity and x is a subordinate entity. Then which one is incorrect?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Deleting subordinate does not affect dominant.

Qus : 65 WB JECA MCA PYQ 2025

Choose the correct statement:

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Alternate key = candidate key not chosen as primary.

Qus : 66 WB JECA MCA PYQ 2025

If one attribute is a determinant of a second, which in turn is a determinant of a third, then the relation cannot be

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Transitive dependency violates 3NF.

Qus : 67 WB JECA MCA PYQ 2025

Which of the following statements regarding relational algebra are true?

(i) R ⋈ S = σ(R×S)

(ii) R ⋈ S = Π(R×S)

(iii) R ⋈ S = R * S

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Join is selection over cartesian product.

Qus : 68 WB JECA MCA PYQ 2025

Which process model is best suited when requirements are well understood and unlikely to change?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Waterfall suits stable requirements.

Qus : 69 WB JECA MCA PYQ 2025

Which testing strategy is performed without knowledge of the internal code?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Black-box testing ignores internal code.

Qus : 70 WB JECA MCA PYQ 2025

Which design principle aims to reduce dependencies between modules?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Low coupling reduces dependency.

Qus : 71 WB JECA MCA PYQ 2025

Correct sequence of Risk Management process is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Standard RM sequence starts with identification then assessment.

Qus : 72 WB JECA MCA PYQ 2025

Which of the following testing methods is normally used as the acceptance test for a software system?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Acceptance testing is functional validation.

Qus : 73 WB JECA MCA PYQ 2025

Which of the following is not a supervised machine learning algorithm?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

K-means is unsupervised.

Qus : 74 WB JECA MCA PYQ 2025

What is the key benefit of using deep learning for tasks like recognizing images?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Deep learning captures complex patterns automatically.

Qus : 75 WB JECA MCA PYQ 2025

What is the key difference between supervised and unsupervised learning?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Main difference is presence of labeled data.

Qus : 76 WB JECA MCA PYQ 2025

The purpose of an activation function in a neural network is to

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Activation function introduces non-linearity.

Qus : 77 WB JECA MCA PYQ 2025

Hidden Markov Models assume the system is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

HMM models probabilistic (stochastic) processes.

Qus : 78 WB JECA MCA PYQ 2025

In SVMs, the margin is defined as

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Margin = distance to closest support vector.

Qus : 79 WB JECA MCA PYQ 2025

An artificially intelligent car decreases its speed based on its distance from the car in front of it. Which algorithm is used?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Continuous prediction → regression.

Qus : 80 WB JECA MCA PYQ 2025

What will be the output of the following C program?

#include int recur(int n)

{

if(n == 0)

return 0;

else

return n + recur(n - 1); }

int main()

{

int result = recur(4);

printf("%d ", result);

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

recur(4)=4+3+2+1=10.

Qus : 81 WB JECA MCA PYQ 2025

A software module contains 1500 lines of code and 15 defects were found during testing. What is the defect density of the module?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Defect density = 15/1.5 = 10 defects/KLOC.

Qus : 82 WB JECA MCA PYQ 2025

A development team found 90 defects during the design phase. However, 10 additional design defects were discovered during the testing phase. What is the Defect Removal Efficiency (DRE) for the design phase?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

DRE = 90/(90+10)=90%.

Qus : 83 WB JECA MCA PYQ 2025

What will be the output of the following C code?

#include int main()

{

int x;

x = 4<3?100:3==3?2?50:75;

printf("%d", x);

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

4<3 false → evaluate next → 3==3 true → 2?50:75 → 50.

Qus : 84 WB JECA MCA PYQ 2025

Five elements P, Q, R, S, T are pushed onto a stack starting from P. The stack is then popped 4 times, and each popped element is inserted into a queue. Two elements are then deleted from the queue and pushed back onto the stack. Finally, one element is popped from the stack. What will be the popped element?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Final popped element becomes Q after operations.

Qus : 85 WB JECA MCA PYQ 2025

Consider the following operations on a singly linked list initially containing the elements: 10 → 20 → 30 → 40

(i) Insert 15 after 10

(ii) Delete node containing 30

(iii) Insert 25 at end

(iv) Delete first node.

What will be the final sequence?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Final list: 20 → 15 → 25 → 40.

Qus : 86 WB JECA MCA PYQ 2025

A complete binary tree has 63 nodes. How many leaf nodes does it have?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Leaves = (n+1)/2 = 32.

Qus : 87 WB JECA MCA PYQ 2025

Find the output from the following C++ code snippet:

class A

{

public: void show()

{

cout<<"Class A ";

}

};

class B: public A

{

public: void show()

{

A::show();

cout<<"Class B";

}

};

int main()

{

B obj;

obj.show();

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Calls A::show then prints Class B.

Qus : 88 WB JECA MCA PYQ 2025

What will be the output of this program?

#include using namespace std;

class Test

{

public: static int x;

Test()

{

x++;

}

void display()

{

cout<

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

x=5 → t1→6, t2→7.

Qus : 89 WB JECA MCA PYQ 2025

What is the output of the following C++ code?

#include using namespace std;

class Base

{

public: virtual void show()

{

cout<<"Base";

}

};

class Derived: public Base

{

public: void show()

override{ cout<<"Derived"; }

};

int main()

{

Base* ptr;

Derived d;

ptr=&d;

ptr->show();

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Virtual function → Derived called.

Qus : 90 WB JECA MCA PYQ 2025

Which of the following are true about cyclomatic complexity?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Cyclomatic complexity counts independent paths; higher value = more complex.

Qus : 91 WB JECA MCA PYQ 2025

A testing phase executes 180 test cases out of 200 planned, with 162 passes and 18 failures. Which are true?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Execution=180/200=90%, Pass=162/180=90%, Req=85%.

Qus : 92 WB JECA MCA PYQ 2025

In the context of Software Development Life Cycle (SDLC), which of the following statements is correct?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

V-model aligns testing with each development phase.

Qus : 93 WB JECA MCA PYQ 2025

The number of cross point needed for 10 lines cross point switch in full duplex in nature and there are no self connection is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Crosspoints = n(n−1)/2 = 45.

Qus : 94 WB JECA MCA PYQ 2025

Maximum data rate of a channel for noiseless 3 KHz binary channel is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Nyquist: 2B log2M = 2×3000×1 = 6000 bps.

Qus : 95 WB JECA MCA PYQ 2025

A computer with 32 bit wide data bus uses 4K × 8 static RAM memory chips. The smallest memory of this computer is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Need 4 chips → 4K×32 = 16KB.

Qus : 96 WB JECA MCA PYQ 2025

A machine needs a minimum of 100 second to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Time ∝ n log n → approx 6.7 sec.

Qus : 97 WB JECA MCA PYQ 2025

Choose the correct answer: If X is a Boolean variable then

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Boolean algebra: 0+X = X.

Qus : 98 WB JECA MCA PYQ 2025

Which of following units can be used to measure the speed of a computer?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

MIPS is standard CPU speed metric.

Qus : 99 WB JECA MCA PYQ 2025

Which of the following are advantages of using a linked list over arrays?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Dynamic size + easy insertion; but random access not faster.

Qus : 100 WB JECA MCA PYQ 2025

The physical relationship of record is determined by a mathematical formula that transforms a file key into a record location in

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

A mathematical formula that maps a key directly to a storage location is called a hash function. This is used in hashed files.

WB JECA MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

WB JECA MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Please provide more information - at least 10 characters

Feedback

Info.

Information

Aspire's Library

WB JECA MCA Previous Year Questions (PYQs)

WB JECA MCA 2025 PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution